On the g-entropy and its Hudetz correction

نویسنده

  • Beloslav Riecan
چکیده

The fuzzy entropy h(T) of a dynamical system has been introduced in [5] (see also [1, 3, 8, 10]). Generalizing the notion of a fuzzy partition Mesiar and Rybarik have studied the p-entropy (see [7, 10, 11]) based on the Pap y-calculus ([9]). The notion is based on an increasing bijective function g : [0,oo] —> [0, oo], such that #(0) = 0 and #(1) = 1. The choice g(x) = x leads to the fuzzy entropy. The corresponding theorem states that to any ^-decomposable measure there exists a fuzzy measure such that the p-entropy can be expressed by the fuzzy entropy. Of course, the fuzzy entropy depends on a family T of fuzzy sets. If ^contains all constant functions, then the fuzzy entropy equals infinity. This defect has been corrected by Hudetz ([4]) by introducing a correcting member in the definition of the entropy of a fuzzy partition. The aim of this paper is a study of an analogous correction in the case of ^-entropy. Similarly as Mesiar and Rybarik in [7] we prove the corresponding representation theorem. We construct also an example demonstrating that the Hudetz modification of ^-entropy can be used although the usual g entropy is not available.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ON LOCAL HUDETZ g-ENTROPY

In this paper, a local approach to the concept of Hudetz $g$-entropy is presented. The introduced concept is stated in terms of Hudetz $g$-entropy. This representation is based on the concept of $g$-ergodic decomposition which is a result of the Choquet's representation Theorem for compact convex metrizable subsets of locally convex spaces.

متن کامل

ENTROPY OF DYNAMICAL SYSTEMS ON WEIGHTS OF A GRAPH

Let $G$ be a finite simple graph whose vertices and edges are weighted by two functions. In this paper we shall define and calculate entropy of a dynamical system on weights of the graph $G$, by using the weights of vertices and edges of $G$. We examine the conditions under which entropy of the dynamical system is zero, possitive or $+infty$. At the end it is shown that, for $rin [0,+infty]$, t...

متن کامل

On the Monotone Behavior of Time Dependent Entropy of Order alpha

In this paper we study some monotone behavior of the residual (past) entropy of order . We prove that, under some relation between the hazard rates (reversed hazard rates) of two distributions functions F and G, when the residual (past) entropy of order of F is decreasing (increasing) then the residual (past) entropy of G is decreasing (increasing). Using this, several conclusions regarding mo...

متن کامل

A Preferred Definition of Conditional Rényi Entropy

The Rényi entropy is a generalization of Shannon entropy to a one-parameter family of entropies. Tsallis entropy too is a generalization of Shannon entropy. The measure for Tsallis entropy is non-logarithmic. After the introduction of Shannon entropy , the conditional Shannon entropy was derived and its properties became known. Also, for Tsallis entropy, the conditional entropy was introduced a...

متن کامل

Entropy Estimate for Maps on Forests

A 1993 result of J. Llibre, and M. Misiurewicz, (Theorem A [5]), states that if a continuous map f of a graph into itself has an s-horseshoe, then the topological entropy of f is greater than or equal to logs, that is h( f ) ? logs. Also a 1980 result of L.S. Block, J. Guckenheimer, M. Misiurewicz and L.S. Young (Lemma 1.5 [3]) states that if G is an A-graph of f then h(G) ? h( f ). In this pap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Kybernetika

دوره 38  شماره 

صفحات  -

تاریخ انتشار 2002